Floats, Integers, and Single Source Shortest Paths
نویسنده
چکیده
Floats are ugly, but to everyone but theoretical computer scientists, they are the real thing. A linear time algorithm is presented for the undirected single source shortest paths problem with oating point weights.
منابع مشابه
Cs 267 Lecture 3
Single-source shortest paths. In the single-source shortest paths problem (SSSP), we are given a graph G = (V,E) and a source node s ∈ V , and we must compute d(s, v) for all v ∈ V . If the graph is unweighted, we can solve this in O(m + n) time by breadth-first search (BFS). If the graph has nonnegative integer weights, we can use Dijkstra’s algorithm with Fibonacci heaps, yielding a runtime o...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملFast Algorithms for Shortest Paths and Sorting
A priority queue (pq) is said to be monotone if the value of the smallest element stored in the priority queue is a non-decreasing function of time. We consider the problem of maintaining a monotone priority queue on a set of integers in the range 0 : :2 w ? 1 on a unit-cost RAM with word size w bits. We give a monotone pq that, starting with an empty collection of items, processes a sequence o...
متن کاملConversion of Network Problem with Transfer Nodes, and Condition of Supplying the Demand of any Sink from the Particular Source to the Transportation Problem
In this article we present an algorithm for converting a network problem with several sources and several sinks including several transfer nodes and condition of supplying the demand of any sink from a particular source to the transportation problem. Towards this end, and considering the very special structure of transportation algorithm, after implementing the shortest path algorithm or ...
متن کاملSingle Source Shortest Paths for All Flows with Integer Costs
We consider a shortest path problem for a directed graph with edges labeled with a cost and a capacity. The problem is to push an unsplittable flow f from a specified source to all other vertices with the minimum cost for all f values. Let G = (V,E) with |V | = n and |E| = m. If there are t different capacity values, we can solve the single source shortest path problem t times for all f in O(tm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Algorithms
دوره 35 شماره
صفحات -
تاریخ انتشار 1998